Postscript: "Endomorphism spectra of graphs" [Discrete Mathematics 109 (1992) 45-57]
نویسندگان
چکیده
We answer some questions about the existence of graphs with a given endotype posed in B* ottcher and Knauer (Discrete Math. 109 (1992) 45–57). All de8nitions and needed terminology can be found there and for brevity they will not be repeated here. All results have been obtained by computer calculations. c © 2003 Elsevier B.V. All rights reserved. MSC: 05C
منابع مشابه
Prefibers and the cartesian product of metric spaces
Tardif, C., Prefibers and the Cartesian product of metric spaces, Discrete Mathematics 109 (1992) 283-288. The properties of certain sets called prefibers in a metric space are used to show that the algebraic properties of the Cartesian product of graphs generalize to metric spaces.
متن کاملEndomorphisms of undirected modifications of directed graphs
If z is an automorphism (or an endomorphism) of H, then it is also an automorphism (or an endomorphism) of %H and of %H. Hence the automorphism group Aut H is a subgroup of Aut 9?H and of Aut %H. Is there any other relation between the groups Aut H, Aut CBH and Aut %H? More in detail, which spans of groups, see Fig. 1, where m,, m2 are monomorphisms, can be realized by directed graphs H (in the...
متن کاملPseudo-median graphs are join spaces
Bandelt, H.-J. and H.M. Mulder, Pseudo-median graphs are join spaces, Discrete Mathematics 109 (1992) 13-26. Median graphs are known to share a number of geometrica! properties with Euclidean space, as is testified by the fact that median graphs ale (c!osed) join spaces-the segments of the associated join space being the geodesic intervals of the graph. As is shown in this paper the median join...
متن کاملSteiner's Problem in Graphs: Heuristic Methods
VoD, S., Steiner’s problem in graphs: heuristic methods, Discrete Applied Mathematics 40 (1992) 45-72. Real world problems arising in the layout of connection structures in networks as e.g. in VLSI design may often be decomposed into a number of well-known combinatorial optimization problems. Steiner’s problem in graphs is included within this context. According to its complexity one is interes...
متن کاملParallel connections and coloured Tutte polynomials
We give formulas for the Tutte polynomials of parallel and series connections of weightedmatroids, generalizing and unifying formulas of Oxley and Welsh (Discrete Math. 109 (1992) 185), Bollobás and Riordan (Comb. Probab. Comput. 8 (1999) 45) and Woodall (Discrete Math. 247 (2002) 201). © 2004 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 270 شماره
صفحات -
تاریخ انتشار 2003